Method and apparatus for interference signal code power and noise variance estimation

ABSTRACT

Method and apparatus for interference signal code power noise variance estimation employing a reduced number of samples utilizing the equation  
             σ   ^     n   2     =     T   ·       ∑     i   =   1       N   sample                   h     n        (   i   )              2           ,                 
 
     where  
         T   =       G   ·     γ        (   r   )           N   sample         ,                 
 
     where  
       N   sample   =L   chest   −N   p1   ·K   max ,  
     where  
         γ        (   r   )       =       [     1   +       (       1   r     -   1     )     ·     ln        (     1   -   r     )           ]       -   1                     
 
     and where  
       r   =         N   sample       L   chest       .                   
 
     As an alternative, a recursive technique may be employed wherein the noise variance is estimated from the ignored coefficients of the estimated channel output and upgraded recursively as per the following:  
             σ   ^     n   2     =       1   KW            ∑     j   =   1     K            ∑     i   =   1     W                   h   i     (   j   )       -       h   ^     i     (   j   )              2             ,                 
 
     where ĥ i   (j)  are the channel estimates after the post processing and the noise variance estimates {circumflex over (σ)} n−1   2 , and the initial values of ĥ i   (j)  are all zeros.

CROSS REFERENCE TO RELATED APPLICATION

[0001] This application claims priority from Provisional Patent Application No. 60/322,927, filed Sep. 18, 2001.

BACKGROUND

[0002] The present invention is generally related to wireless time division duplex (TDD) or frequency division duplex (FDD) communication systems. More particularly, the present invention is related to a TDD communication system which implements an estimation method for interference signal code power (ISCP) and noise variance using a partial sample averaging.

[0003] In a UMTS terrestrial radio access TDD system, the estimation of ISCP and noise variance has become increasingly important. The receiver design requires an estimate of the noise variance for the post processing of the channel estimation and minimum mean square error-block linear equalization (MMSE-BLE) algorithm used by multi-user detection (MUD). In addition, the dynamic channel assignment dynamic channel allocation (DCA) and timeslot allocation relies on an accurate estimate of interference signal code power (ISCP) as well. As defined in the 3GPP TS25.225, the measurement “timeslot ISCP” is only a measure of the intercell interference. Because intercell interference can be treated as white Gaussian noise, the estimates of ISCP and noise variance can be combined into one step. A prior estimation method uses the chip sequence in the guard period. However, due to the timing advance and the length of delay spread, there are not a sufficient number of chips in the guard period available for performing the estimation.

SUMMARY

[0004] The present invention provides a background noise power estimator using the estimated coefficients of the channel impulse responses.

BRIEF DESCRIPTION OF THE DRAWINGS

[0005]FIG. 1 is a theoretical ensemble average power of the truncated Rayleigh distributed random variable and the numerical average of the sample power with respect to the number of smaller samples out of W=57 chips of each channel estimate, and showing the simulated curve and the theoretical curve.

[0006]FIG. 2 is a plot showing the average and mean square error of the estimated noise variance using the algorithm 1 and normalized by the actual noise variance. 10,000 independent simulations are averaged.

[0007]FIG. 3 is an estimated noise variance sequence normalized by the actual noise variance. Working group 4 (WG4) case 2 (slow fading) at 3 dB Eb/No. FIG. 3a shows the estimation from the guard period (GP) and FIGS. 3b and 3 c show the estimated noise variance respectively employing algorithm 1 and 2.

[0008]FIG. 4(a) shows Raw BER curves, FIG. 4(b) shows the normalized average of the estimated noise variance and FIG. 4(c) shows the Mean square error of the estimates normalized by the actual variance. Algorithm 1 is utilized with 30 samples, and algorithm 2 is utilized with 6 recursions in working group 4 (WG4) channel case 2 (slow fading).

[0009]FIG. 5(a) shows the raw BER curves, FIG. 5(b) shows the normalized average of the estimated noise variance and FIG. 5(c) shows the Mean square error of the estimates normalized by the actual variance. Algorithm 1 with 30 samples, and algorithm 2 with 6 recursions in International Telecommunication Union (ITU) pedestrian B channel case.

[0010]FIG. 6 is a block diagram of channel estimation and post processing for a UE receiver showing the manner in which noise variance estimator obtained in accordance with the method and apparatus of the present invention is employed.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0011] In the present invention, an estimation method of ISCP and noise variance using the output information of the channel estimator is used. The method overcomes the problems of prior art estimation methods and offers much better accuracy in estimates used by dynamic channel allocation (DCA) and multi-user detection (MUD). In particular, an algorithm of partial sample averaging is used to realize the computation.

[0012] Although the present inventive method of estimation of ISCP and noise variance is based on a WCDMA TDD system, the algorithm can be applied to all kinds of communications systems using the information of estimated channel response, including WCDMA FDD systems. FIGS. 3b and 3 c show the noise variance estimations employing algorithms 1 and 2 of the present invention compared with the noise variance obtained from the guard period (GP).

[0013] The following is a description of the signal model for Steiner channel estimation. Let K_(max) be the maximum number of distinct midambles allowed by one basic midamble code. Then K_(max)=16, 8 or 4 for burst type 1 and K_(max)=6 or 3 for burst type 2. The signal model for a received sequence is represented by: $\begin{matrix} {\underset{\_}{r} = {{{G\underset{\_}{h}} + \underset{\_}{n}} = {{\left\lbrack {G1} \middle| {G2} \middle| \cdots \middle| {GK} \right\rbrack \begin{bmatrix} {\underset{\_}{h}}^{(1)} \\ {\underset{\_}{h}}^{(2)} \\ \vdots \\ {\underset{\_}{h}}^{(K)} \end{bmatrix}} + n}}} & \text{Equation~~(1)} \end{matrix}$

[0014] and the maximum-likelihood estimate (MLE) is given by:

ĥ=( G ^(H) G)⁻¹ G ^(H) r=h+w,   Equation(2)

[0015] where:

w=( G ^(H) G)⁻¹ G ^(H) n.   Equation (3)

[0016] In the case when the active midamble shifts are exactly known, (uplink or downlink with a common midamble shift), the number of block columns of matrix G and the interference can be reduced. However, there is no performance gain as can be seen from a comparison of the maximum midamble shifts (K_(max)) and the active midamble shifts (K_(active)). In fact, the complexity of the system is increased since the coefficients of the pseudo inverse matrix must to be computed per every timeslot. Assuming the maximum number of midambles, they will be computed only once after the cell specification. Moreover, the output sequence with no signal component is useful for the ISCP and noise variance estimation even in the case of a known midamble. Hence the channel estimator is desired to provide K_(max) number of channel estimates no matter how many midambles are active.

[0017] The following describes the proposed estimation method for ISCP and noise variance in accordance with the present invention. The chip length of the output sequence of the channel estimator is always K_(max)W, where W is the length of the channel impulse response. Most of the output sequences comprise only the ISCP and a noise component, and a few include the signal and a noise component. When the active midambles are known, the estimation can be easily obtained from the channel estimates for the inactive midambles. However, for the cases of uplink and downlink with a common midamble where the midambles are unknown, estimation becomes problematic. The forgoing description is directed to downlink channels with multiple midambles where the active midambles are unknown.

[0018] The ISCP and noise variance will be referred to, for simplicity, as the noise variance for algorithm 1, partial sample average, the probability density function of the amplitude of the complex noise is a Rayleigh function represented by: $\begin{matrix} {{{f(x)} = {\frac{2x}{\sigma_{w}^{2}}{\exp \left( {- \frac{x^{2}}{\sigma_{w}^{2}}} \right)}{U(x)}}};} & \text{Equation~~(4)} \end{matrix}$

[0019] where σ_(w) ² is its variance.

[0020] The goal is to estimate the variance from the smallest number of samples. The average of the estimate and the mean square error both decrease with an increasing number of samples as shown in FIG. 3. Obviously, the average of the sample power does not converge to the ensemble average power. Rather, when the smallest N out of W samples are used, the sample variance will converge to the second moment represented by: $\begin{matrix} {{\sigma_{a}^{2} = {\int_{x = o}^{a}{x^{2}{f(x)}{x}}}};} & \text{Equation~~(5)} \end{matrix}$

[0021] where a satisfies ${\Pr \left\{ {x < a} \right\}} = {\frac{N}{W}.}$

[0022] After a short derivation, $\begin{matrix} {{a = \sqrt{{- \sigma_{w}^{2}}{\ln \left( {1 - \frac{N}{W}} \right)}}},} & \text{Equation~~(6)} \end{matrix}$

[0023] and the ensemble average power of smallest N out of W samples converge to:

σ_(a) ² =cσ _(w) ²;   Equation (7)

[0024] where $\begin{matrix} {c = {\frac{N}{W} + {\left( {1 - \frac{N}{W}} \right) \cdot {{\ln \left( {1 - \frac{N}{W}} \right)}.}}}} & \text{Equation~~(8)} \end{matrix}$

[0025] Hence, the scaling factor c is a function of the ratio N/W. The theoretical and numerical scaling factors with respect to N are shown in FIG. 1 in the situation of burst type 1 and W=57.

[0026] Using this scaling factor, the noise variance estimate from the N smallest samples out of W becomes: $\begin{matrix} {{{\hat{\sigma}}_{w}^{2} = {\frac{1}{c\quad K\quad N}{\sum\limits_{j = l}^{K}{\sum\limits_{i = l}^{N}{h_{i}^{(j)}}^{2}}}}},} & \text{Equation~~(9)} \end{matrix}$

[0027] where h_(i) ^((j)),i=1,2, . . . , W are in the order of ascending amplitudes.

[0028] The foregoing describes the parameters for the estimation method of noise variance, as well as those used by channel estimation. The estimation method will be described at the system level and with the help of some system parameters. The system parameters include the following:

[0029] W: Channel length.

[0030] K_(max): Maximum number of midamble shifts.

[0031] P: Length of the basic midamble code, which is the length of the input of the channel estimation block.

[0032] L_(m): Length of midamble code.

[0033] L_(chest): Output length of the channel estimator. It is not necessarily equal to W·K_(max) especially for the burst type 1 extended midamble case.

[0034] h_(i), i=1,2, . . . , L_(ches): Estimated joint channel coefficients.

[0035] K_(active): Active number of midamble shifts.

[0036] N_(p1): Maximum number of paths per channel.

[0037] N_(p2): Actual number of paths per channel.

[0038] The specifications and the relations of the above parameters are summarized in Table 1: TABLE 1 Burst Burst type 1 or 3 Burst type 2 structure P = 456, L_(m) = 512 P = 192, L_(m) = 256 K_(max)  16 8 4 6 3 W 28 or 29* 57 57 32 64 L_(chest) 456 456 456 192 192

[0039] The location of the ISCP and noise variance estimation block 14 at user equipment (UE) 10 is shown in FIG. 6. In the uplink, midamble detection 18 and blind code detection 20 blocks are not required since they are already known at the BS receiver. The downlink noise estimation will use K_(max)instead of K_(active) since the active number of midambles is not known and it will be estimated by the midamble detection. The information of the number of active midambles optionally can be fed back to noise (ISCP) estimation block 14, from midamble 18, through path 18 a, but results in a processing delay with little gain in the overall detection performance.

[0040] Here, the proposed estimation algorithm, using a partial sample average, is summarized as follows: $\begin{matrix} {{{\hat{\sigma}}_{n}^{2} = {G \cdot {\gamma (r)} \cdot \frac{1}{N_{sample}} \cdot {\sum\limits_{i = l}^{N_{sample}}{h_{n{(i)}}}^{2}}}}\text{where:}} & \text{Equation~~(10)} \\ {{N_{sample} = {L_{chest} - {N_{pl} \cdot K_{active}}}},} & \text{Equation~~(11)} \\ {{\gamma (r)} = \left\lfloor {1 + {\left( {\frac{1}{r} - 1} \right) \cdot {\ln \left( {1 - r} \right)}}} \right\rfloor^{- 1}} & \text{Equation~~(12)} \\ {{r = {\frac{N_{sample}}{L_{chest}}:\text{sample~~ratio}}},} & \text{Equation~~(13)} \end{matrix}$

[0041] G=400 for burst types 1 and 3,

[0042] and,

[0043] G=169 for burst type 2.

[0044] n(i), i=1,2, . . . ,: Lchest is the index of I-th smallest coefficient, (i.e., hn(i), i=1,2, . . . L_(chest)) which are in the order of ascending amplitude. To simplify the implementation, the constant values can be fixed for each case as shown in Table 2, which shows the scaling constant T with respect to the timeslot configurations; where P is the number of available samples, and those numbers marked with a double asterisk may not be assumed in practice. Here the constant T is defined by: $\begin{matrix} {{T = \frac{G \cdot {\gamma (r)}}{N_{sample}}},} & \text{Equation~~(14)} \end{matrix}$

$\begin{matrix} {{\hat{\sigma}}_{n}^{2} = {T \cdot {\sum\limits_{i = 1}^{N_{sample}}{{h_{n{(i)}}}^{2}.}}}} & \text{Equation~~(15)} \end{matrix}$

[0045] and the estimated noise variance becomes TABLE 2 N p1 = 6 N p1 = 10 k_(max) N samples T N samples T Burst Type 4  432** 1.1** 411 1.3 1 8 411 1.3 375 1.7 P = 456 16  360 1.9  296** 3.1** Burst Type 3 174 1.3 158 1.7 2 6 158 1.7  132** 2.7** P = 192

[0046] As an alternative, noise variance is estimated from the ignored coefficients of the estimated channel output and upgraded recursively as per the following: ${{\hat{\sigma}}_{n}^{2} = {\frac{1}{K\quad W}{\sum\limits_{j = 1}^{K}{\sum\limits_{i = 1}^{W}{{h_{i}^{(j)} - {\hat{h}}_{i}^{(j)}}}^{2}}}}},$

[0047] where ĥ_(i) ^((j)) are the channel estimates after the post processing with the noise variance estimates {circumflex over (σ)}_(n−1) ², and the initial values of ĥ_(i) ^((j)) are all zeros.

[0048] The number of recursions is six (6) in the simulation, which can be reduced depending on the propagation channel condition.

[0049] An example simulation will now be explained. The following is a list of assumptions and parameters used for the present example:

[0050] Burst type 1.

[0051] W=57.

[0052] 8 data bursts with spreading factor (SF)=16.

[0053] 8 distinct midambles.

[0054] WG4 case 2 and ITU pedestrian B channel cases.

[0055] 30 samples for algorithm 1.

[0056] 6 recursions for the algorithm 2.

[0057] the MMSE-BLE performances according to the different schemes are very similar as shown in FIG. 4(a) and FIG. 5(a). Hence, the data detection performance is not so sensitive to the estimation error normalized by the actual noise variance shown in FIG. 4(c) and FIG. 5(c).

[0058] The conclusions obtained are:

[0059] The variance estimate by Algorithm 1 is biased to a little higher value especially with higher SNR and with more multipaths, which can be observed from FIGS. 5(b) and 6(b).

[0060] Algorithm 2 has the best performance but the multiple threshold tests have to be performed for the post processing. The complexity increase is dependent on the number of iterations and the complexity of the comparisons.

[0061] If the noise variance is only for MMSE-BLE and post processing, then algorithm 1 is sufficient for most wireless situations. However, when more accurate noise variance estimation is required where the overall communication system performance is much more sensitive to noise variance estimation error, then algorithm 2 will be the best choice. 

What is claimed is:
 1. A method for use in wireless communication systems of one of the time division duplex (TDD) and frequency division duplex (FDD) type, comprising: (a) performing a channel estimation on a midamble portion of a received burst to obtain a plurality of channel impulse responses; ${\hat{\sigma}}_{n}^{2} = {T \cdot {\sum\limits_{i = l}^{N_{sample}}{h_{n{(i)}}}^{2}}}$

(b) estimating noise variation based on the equation where ${T = \frac{G \cdot {\gamma (r)}}{N_{sample}}},{r = \frac{N_{sample}}{L_{chest}}},{N_{sample} = {L_{chest} - {N_{pl} \cdot K_{\max}}}},$

where h represents the amplitudes of the samples employed, where L_(chest) is the output length of the channel estimator, N_(p1) is the maximum number of paths per channel and K_(max) is the maximum number of midamble shifts.
 2. The method of claim 1 wherein, when the burst received is of burst type 1, setting G equal to
 400. 3. The method of claim 1 wherein, when the burst received is of burst type 2, setting G equal to
 169. 4. The method of claim 1 wherein, when the burst received is of burst type 3, setting G equal to
 400. 5. The method of claim 1 comprising obtaining the scaling constant T from a look-up table, wherein T increases with an increasing value of midamble shifts.
 6. The method of claim 5 wherein the scaling constant is selected in accordance with the permissible midamble shifts which are 4, 8 and 16, when the burst received is burst type
 1. 7. The method of claim 5 wherein the scaling constant selected in accordance with the permissible midamble shifts which are 3 and 6, when the burst received is a burst type
 2. 8. The method of claim 1 further comprising utilizing the values obtained at steps (a) and (b) to obtain one of a few non zero h, and indices of non zero chips, wherein a chip is equal to K_(max)W, where W is the length of the channel impulse response.
 9. The method of claim 8 further comprising determining the number of active midamble shifts based on the values determined at step (b).
 10. The method of claim 9 further comprising utilizing the active midamble shifts obtained at step (b) and a received data field for generating code numbers.
 11. The method of claim 10 further utilizing the aforesaid received data field, code numbers, estimated noise variance, active midamble shifts, and the values obtained at step (b) for determining an estimated symbol sequence.
 12. The method of claim 1 further comprising utilizing the number of active midamble shifts obtained at step (b) for revising the noise variance estimation.
 13. Apparatus for use in wireless communication systems of one of the time division duplex (TDD) and frequency division duplex (FDD) type, comprising: means for performing a channel estimation on a midamble portion of a received burst to obtain a plurality of channel impulse responses; means for estimating noise variation based on the equation ${\hat{\sigma}}_{n}^{2} = {T \cdot {\sum\limits_{i = l}^{N_{sample}}{{h_{n{(i)}}}^{2}\quad \text{where}}}}$ ${T = \frac{G \cdot {\gamma (r)}}{N_{sample}}},{r = \frac{N_{sample}}{L_{chest}}},{N_{sample} = {L_{chest} - {N_{pl} \cdot K_{\max}}}},$

where h represents the amplitudes of the samples employed, where L_(chest) is the output length of the channel estimator, N_(p1) is the maximum number of paths per channel and K_(max) is the maximum number of midamble shifts.
 14. The apparatus of claim 13 wherein, when the burst received is of burst type 1, means are provided for setting G equal to
 400. 15. The apparatus of claim 13 wherein, when the burst received is of burst type 2, means are provided for setting G equal to
 169. 16. The apparatus of claim 13 wherein, when the burst received is of burst type 3, means are provided for setting G equal to
 400. 17. The apparatus of claim 13 further comprising means for obtaining the scaling constant T from a look-up table, wherein T increases with an increasing value of midamble shifts.
 18. The apparatus of claim 17 further comprising means for selecting the scaling constant in accordance with the permissible midamble shifts which are 4, 8 and 16, when the burst received is burst type
 1. 19. The apparatus of claim 17 further comprising means for selecting the scaling constant in accordance with the permissible midamble shifts which are 3 and 6, when the burst received is a burst type
 2. 20. The apparatus of claim 13 further comprising means utilizing the aforesaid received data field, code numbers, estimated noise variance and active midamble shifts for determining an estimated symbol sequence.
 21. The apparatus of claim 13 further comprising means utilizing the number of active midamble shifts for revising the noise variance estimation.
 22. A method for estimating noise variance in wireless communication systems of one of the time division duplex (TDD) and frequency division duplex (FDD) type, comprising: (a) performing a channel estimation on a midamble portion of a received burst to obtain a plurality of channel impulse responses; (b) recursively estimating noise variation based on the equation; ${{\hat{\sigma}}_{n}^{2} = {\frac{1}{K\quad W}{\sum\limits_{j = 1}^{K}{\sum\limits_{i = 1}^{W}{{h_{i}^{(j)} - {\hat{h}}_{i}^{(j)}}}^{2}}}}},$

where ĥ_(i) ^((j)) are the channel estimates after the post processing with the noise variance estimates {circumflex over (σ)}_(n−1) ², and the initial values of ĥ_(i) ^((j)) are all zeros.
 23. The method of claim 24 wherein six (6) recursions are performed during step (b).
 24. The method of claim 23 wherein noise variance is estimated from ignored co-efficients of the estimated channel.
 25. Apparatus for estimating noise variance in wireless communication systems of one of the time division duplex (TDD) and frequency division duplex (FDD) type, comprising: means for performing a channel estimation on a midamble portion of a received burst to obtain a plurality of channel impulse responses; means for recursively estimating noise variation based on the equation: ${{\hat{\sigma}}_{n}^{2} = {\frac{1}{KW}{\sum\limits_{j = 1}^{K}{\sum\limits_{i = 1}^{W}{{h_{i}^{(j)} - {\hat{h}}_{i}^{(j)}}}^{2}}}}},$

where ĥ_(i) ^((j)) are the channel estimates after the post processing with the noise variance estimates {circumflex over (σ)}_(n−1) ², and the initial values of ĥ_(i) ^((j)) are all zeros, the noise variance being estimated from the ignored coefficients of the estimated channel output and upgraded recursively.
 26. The apparatus of claim 25 wherein the recursive means includes means for performing six (6) recursions. 